Optimization guided lower and upper bounds for the resource investment problem
نویسندگان
چکیده
منابع مشابه
Upper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملOn Lower and Upper Bounds for the Resource-Constrained Project Scheduling Problem
In this paper, we consider the well-known resource-constrained project scheduling problem. We propose some arguments that already a special case of this problem with a single type of resources is not approximable in polynomial time with an approximation ratio bounded by a constant. We prove that there exist instances for which the optimal makespan values for the non-preemptive and the preemptiv...
متن کاملA mathematical model for the multi-mode resource investment problem
This paper presents an exact model for the resource investment problem with generalized precedence relations in which the minimum or maximum time lags between a pair of activities may vary depending on the chosen modes. All resources considered are renewable. The objective is to determine a mode and a start time for each activity so that all constraints are obeyed and the resource investment co...
متن کاملLower and Upper Bounds for the Master Bay Planning Problem
In this work we tackle the problem of the stowage of containers on a ship, the so-called Master Bay Planning Problem (MBPP). This is an important hard combinatorial optimization problem in the context of maritime port logistics which has proven to be really difficult to solve. We propose two new lower bounds and two new upper bounds which are useful to solve it. In order to test both the effici...
متن کاملImproved upper and lower bounds for the point placement problem
The point placement problem is to determine the positions of a set of n distinct points, P = {p1, p2, p3, . . . , pn}, on a line uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points. Each distance query corresponds to an edge in a graph, called point placement graph (ppg), whose vertex set is P . The uniqueness requirement of the placemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2001
ISSN: 0160-5682,1476-9360
DOI: 10.1057/palgrave.jors.2601099